package com.aiguigu.LeetCode;

import sun.java2d.pipe.SpanIterator;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

public class findMedianSortedArrays {
    public static void main(String[] args) {
        Swaap swaap1 = new Swaap("zhangx");
        Swaap swaap2 = new Swaap("lisi");
        swap(swaap1,swaap2);
        System.out.println(swaap1.name);
        System.out.println(swaap2.name);

    }

    public static void swap(Swaap m,Swaap n ){
        String temp = m.name;
        m.name = n.name;
        n.name= temp;

      /*  System.out.println("m  "+m);
        System.out.println("n  "+n);*/
    }



}

class Swaap{
    String name;

    public Swaap(String name) {
        this.name = name;
    }
}

